Hierarchical Hybrid Planning for Mobile Robots
نویسندگان
چکیده
منابع مشابه
Path Planning for Mobile Robots Based on Hybrid Architecture Platform
In this paper, a hybrid architecture is used to develop the software platform of path planning of mobile robots. It consists of four levels: the decision-making layer, the behavior layer, the command parsing layer and the hardware communication layer. The whole framework of the decision-making system is based on the global planning, which is realized by using the ant colony algorithm. In the pr...
متن کاملHierarchical path planning of mobile robots in complex indoor environments
Inspired by the hierarchical D* (HD*) algorithm of D. Cagigas (Cagigas, 2005), in this paper we introduce a novel hierarchical path planning algorithm called focused hierarchical D* (FHD*). Unlike the original HD* algorithm, the FHD* algorithm guarantees the optimality of the global path, and it requires considerably less time for the path replanning operations. This is achieved with several mo...
متن کاملLifelong Planning for Mobile Robots
Mobile robots often have to replan as their knowledge of the world changes. Lifelong planning is a paradigm that allows them to replan much faster than with complete searches from scratch, yet nds optimal solutions. To demonstrate this paradigm, we apply it to Greedy Mapping, a simple sensor-based planning method that always moves the robot from its current cell to the closest cell that it has ...
متن کاملClassic planning for mobile robots
The paper describes an approach to reasoning about actions and plan generation within the framework of description logics Our proposal is considered classic since it is in the style of deductive planning and it relies upon the reasoning capabilities of description logics that are realized in the system Classic From an epistemological point of view our approach is based on the formalization of a...
متن کاملDirect Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration
This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KI - Künstliche Intelligenz
سال: 2017
ISSN: 0933-1875,1610-1987
DOI: 10.1007/s13218-017-0507-7